A closer look at declarative interpretations
نویسندگان
چکیده
منابع مشابه
A Closer Look at Declarative Interpretations
Three semantics have been proposed as the most promising candidates for a declarative interpretation for logic programs and pure Prolog programs: the least Herbrand model, the least term model, i.e. the C-semantics, and the S-semantics. Previous results show that a strictly increasing information ordering between these semantics exists for the class of all programs. In particular, the S-semanti...
متن کاملA Closer Look at Preduction
In a recent paper Jun Arima formalises the idea of preduc-tion { a non-monotonic schema providing a common basis for inductive and analogical reasoning. We examine some of the implications of this schema, as well as its connections with prototypes and conceptual spaces. A generalised version of his schema is motivated and developed to address diiculties with asymmetry and disjuncts.
متن کاملA Closer Look at HMAC
Bellare, Canetti and Krawczyk [BCK96] show that cascading an ε-secure (fixed input length) PRF gives an O(εnq)-secure (variable input length) PRF when making at most q prefix-free queries of length n blocks. We observe that this translates to the same bound for NMAC (which is the cascade without the prefix-free requirement but an additional application of the PRF at the end), and give a matchin...
متن کاملA Closer Look at Trumping1
According to Schaffer (2000a), “trumping preemption” is a category of redundant causation distinct from early and late preemption and from overdetermination. I show that the putative causal difference between causal processes in cases thought to be trumping preemption generates early preemption or overdetermination rather than trumping. I draw a novel lesson from cases thought to be trumping: t...
متن کاملReportrapport Declarative Interpretations Reconsidered Declarative Interpretations Reconsidered
Three semantics have been proposed as the most promising candidates for a declarative interpretation for logic programs and pure Prolog programs: the least Herbrand model, the least term model, i.e. the C-semantics, and the S-semantics. Previous results show that a strictly increasing information ordering between these semantics exists for the class of all programs. In particular, the S-semanti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1996
ISSN: 0743-1066
DOI: 10.1016/0743-1066(95)00150-6